Geometric Spectral Partitioning
نویسندگان
چکیده
We investigate a new method for partitioning a graph into two equal-sized pieces with few connecting edges. We combine ideas from two recently suggested partitioning algorithms, spectral bisection (which uses an eigenvector of a matrix associated with the graph) and geometric bisection (which applies to graphs that are meshes in Euclidean space). The new method does not require geometric coordinates, and it produces partitions that are often better than either the spectral or geometric ones.
منابع مشابه
Geometric Multiscale Community Detection: Markov Stability and Vector Partitioning
Multiscale community detection can be viewed from a dynamical perspective within the Markov Stability framework, which uses the diffusion of a Markov process on the graph to uncover intrinsic network substructures across all scales. Here we reformulate multiscale community detection as a max-sum length vector partitioning problem with respect to the set of time-dependent node vectors expressed ...
متن کاملMultiway partitioning via geometric embeddings, orderings, and dynamic programming
AbstructThis paper presents effective algorithms for multiway partitioning. Confirming ideas originally due to Hall, we demonstrate that geometric embeddings of the circuit netlist can lead to high-quality k-way partitionings. The netlist embeddings are derived via the computation of d eigenvectors of the Laplacian for a graph representation of the netlist. As Hall did not specify how to partit...
متن کاملA Data-Parallel Implementation of the Geometric Partitioning Algorithm
We present a data-parallel, High Performance Fortran (HPF) implementation of the geometric partitioning algorithm. The geometric partitioning algorithm has provably good partitioning quality. To our knowledge, our implementation is the rst data{parallel implementation of the algorithm. Our data{parallel formulation makes extensive use of segmented preex sums and parallel selections, and provide...
متن کاملSpectral Partitioning : The More Eigenvectors , The BetterCharles
The graph partitioning problem is to divide the vertices of a graph into disjoint clusters to minimize the total cost of the edges cut by the clusters. A spectral partitioning heuristic uses the graph's eigenvectors to construct a geometric representation of the graph (e.g., linear orderings) which are subsequently partitioned. Our main result shows that when all the eigenvectors are used, grap...
متن کاملMulti-Way Partitioning Via Space lling Curves and Dynamic Programming
Spectral geometric embeddings of a circuit netlist can lead to fast, high quality multi-way partitioning solutions. Furthermore, it has been shown that d-dimensional spectral embeddings (d > 1) are a more powerful tool than single-eigenvector embeddings (d = 1) for multi-way partitioning [2] [4]. However, previous methods cannot fully utilize information from the spectral embedding while optimi...
متن کامل